convex programming
英 [ˈkɒnveks ˈprəʊɡræmɪŋ]
美 [ˈkɑːnveks ˈproʊɡræmɪŋ]
网络 凸规划
双语例句
- An on-line training algorithm is presented to avoid repetitious solving the convex programming problem.
并给出一种？着调整时的在线训练算法，避免重复求解凸规划问题。 - The first two cases can be converted into quadratic model or convex programming problem with quadratic constraint, but the third one is a nonconvex programming problem.
将该模型的计算转化为求解一个凸二次规划问题，不仅保证了解的唯一性和存在性，还使得该方法能够用于大规模混合输电权市场中的竞价策略分析。 - Spectrum Access Algorithm Based on Convex Programming in Distributed Cognitive Wireless Networks
分布式认知无线网络中的频谱接入凸规划算法 - This paper considers a convex programming with an additional reverse convex constraint. A kind of conical branch and bound method is developed and convergence conditions are obtained.
考虑了一种带有反凸约束的凸规划问题，发展了一种锥分枝定界方法，并给出收敛性条件。 - To the nonconvex programming, the article makes it local convexification by introducing a simple penalty function into the objective function, and solves it like solving convex programming.
针对非凸规划，本文引进一简单的惩罚函数将其局部凸化，然后用凸规划的方法求解。 - Lagrange multipliers and duality in generalized convex programming
广义凸规划中的Lagrange乘子及对偶 - Application of the parallelization technique to a dual method for a constrained convex programming problem
并行技术在约束凸规划化问题的对偶算法中的应用 - Based on a new class equivalent condition of convex programming problems, which was first presented by Fischer, a new continuous method was put forward to solve the problem.
利用Fischer提出的一类新的凸规划问题等价条件，给出了一个解此问题新的连续化方法。 - Based on the dual relaxation method, an extended convex programming and sequential linear programming optimal power flow approach is presented for online optimal dispatch.
提出了一种基于对偶松弛法的扩展凸规划和序列线性规划相结合的在线最优潮流方法。 - Computer-Aided Topology Optimization Using Convex Programming Method
基于凸规划方法的计算机辅助结构拓扑优化设计 - In this paper, an equivalent convex programming model for general discrete dynamic and open-loop Stackelberg games of two persons is constructed based on the principle of multipliers method. An hierarchical optimization algorithm is proposed to solve this problem.
本文依据乘子法的基本原理，构造了一般离散动态开环Stackelberg两人对策问题的等价凸规划问题，提出了求解该问题的递阶优化算法。 - This paper presents a new neural network for nonlinear convex programming problems with linear constraints, defines its Lyapunov function, and proves its stability.
基于最优性的充要条件，提出了一种解线性约束非线性凸规划的新神经网络，构造了恰当的Lyapunov函数，证明了其稳定性。 - We analyze it theoretically, and convert it into two convex programming problems.
本文对这一非凸问题进行了详细的理论分析，并将这一问题转化为两个凸规划问题。 - An improvement on suboptimization methods for convex programming with linear constraints
解线性约束凸规划的次最优化方法和改进 - This paper sets up a dual problem for nondifferentiable convex programming with equality constraints and proves the weak duality and strong duality. The relation of strong duality with Lagrange foctor is discussed.
本文建立带有等式约束的非可微凸规划的新的对偶问题，证明了其弱对偶性及强对偶性，并讨论了强对偶性与Lagrange因子的关系。 - The distance algorithm is an approach to solve convex programming problem.
距离函数算法是一种适用于求解凸规划的算法，本文对其作了推广。 - In this paper, a new type of generalized convexity& semilocal E-convexity is introduced, and some of its basic characters are studied, some optimality conditions and duality theorems for the associated generalized convex programming are discussed.
在本文中，我们提出一类新的广义凸性：半局部E-凸性，研究了它的一些基本性质，讨论了相关广义凸规划的某些最优性条件与对偶定理。 - The paper sets up a new dual problem of a nondifferentiable convex programming problem and proves its dual properties such as weak duality, strong duality and converse duality.
本文对非可微凸规划问题建立了一个新的对偶问题，并证明其对偶性质，如弱对偶性，强对偶性及逆对偶性。 - Objective: To search optimal solutions of convex programming problems with linear constraints.
求线性约束凸规划问题的最优解。 - A Nondifferentiable Convex Programming Algorithm
一个凸不可微规划的算法 - Duality Theory of Multiobjective Arcwise-convex Programming
多目标弧式凸规划的对偶理论 - In this paper, we set up a new dual problem for nondifferentiable convex programming which is different from well known dual problems and prove the weak duality and the strong duality.
文章建立关于非可微凸规划的一个新的对偶问题，它不同于已知的对偶问题，文中证明了弱对偶性及强对偶性。 - A mathematical model and its algorithm have been established by applying nonlinear convex programming and reliability theory. The formulae for calculating reliability design for the transport system are obtained, which provide information for diagnosis and prediction of reliability.
应用非线性凸规划及可靠性理论，建立了采区运输系统可靠度冗余设计的数学模型及其算法，得到了该系统冗余设计量的计算公式，提供了可靠度水平的诊断和预测信息。 - A modification of the ellipsoid method for convex programming and its application in linear programming
对于凸规划椭球方法的一个修正及其在线性规划中的应用 - AimTo construct the simple and feasible neural networks for solving a class of linearly constrained convex programming problems.
目的建立求解一类线性约束非线性凸规划的简单可行的神经网络。 - Several classes of generalized ρ convex functions are presented by using Ben Tal generalized algebraic operation. Under the weak assumptions, optimality sufficient condition of generalized convex programming is given.
利用Ben-Tal广义代数运算，提出了几类广义ρ-凸函数的定义，并在一定的假设条件下，讨论和得到了一类可微广义凸规划的最优性充分条件。 - The optimization problem can be solved based on the density-stiffness interpolation scheme and the method of moving asymptotes belonging to sequential convex programming approaches.
采用基于密度刚度插值模型和序列凸规划法中的移动渐近线方法求解优化模型.通过经典算例验证了本方法的有效性。 - Interior point method is a polynomial time complexity algorithm for solving convex programming, and this method and many related algorithms have been widely used in power system.
内点算法是求解凸规划的多项式时间复杂度算法，各种内点算法及其相关算法在求解最优潮流和动态最优潮流问题上得到了广泛的应用。 - Two methods in designing mismatched filter have been introduced in this paper: weighting sidelobes mismatched filter and convex programming mismatched filter.
主要介绍了两种失配滤波器的设计方法：加权旁瓣失配滤波器和基于凸规划的失配滤波器。 - In third section, a new neural network is proposed to solve nonlinear convex programming problems.
在第三部分，我们提出了一个求解一般非线性凸规划问题的神经网络。